import java.util.Scanner;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User:龙宝
 * Date:2024-09-05
 * Time:16:32
 */
public class test2 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();//长度
        int k = sc.nextInt();//种类数
        System.out.println(fun(n,k));
    }

    private static Long fun(int n, int k) {
//        if(n % 2 != 0){
//            return 0L;
//        }
        int halfn = n / 2;
        long[][] dp = new long[halfn+1][halfn + 1];
        dp[0][0] = 1;
        for (int i = 1;i<=halfn;i++){
            for (int j = 0;j<=i;j++){
                if(j > 0){
                    dp[i][j] += dp[i-1][j-1];
                }
                if(j < i){
                    dp[i][j] += dp[i-1][j+1];
                }
            }
        }
        return (long)Math.pow(dp[halfn][0],k);
    }


}
